Iterated Lavrentiev Regularization for Nonlinear Ill-posed Problems
نویسندگان
چکیده
We consider an iterated form of Lavrentiev regularization, using a null sequence (αk) of positive real numbers to obtain a stable approximate solution for ill-posed nonlinear equations of the form F(x)= y, where F : D(F)⊆ X→ X is a nonlinear operator and X is a Hilbert space. Recently, Bakushinsky and Smirnova [“Iterative regularization and generalized discrepancy principle for monotone operator equations”, Numer. Funct. Anal. Optim. 28 (2007) 13–25] considered an a posteriori strategy to find a stopping index kδ corresponding to inexact data y with ‖y − y‖ ≤ δ resulting in the convergence of the method as δ→ 0. However, they provided no error estimates. We consider an alternate strategy to find a stopping index which not only leads to the convergence of the method, but also provides an order optimal error estimate under a general source condition. Moreover, the condition that we impose on (αk) is weaker than that considered by Bakushinsky and Smirnova. 2000 Mathematics subject classification: primary 47A52; secondary 65F22, 65J15, 65J22, 65M30.
منابع مشابه
Lavrentiev-type Regularization Methods for Hermitian Problems
Lavrentiev regularization is a popular approach to the solution of linear discrete illposed problems with a Hermitian positive semidefinite matrix. This paper describes Lavrentiev-type regularization methods that can be applied to the solution of linear discrete ill-posed problems with a general Hermitian matrix. Fractional Lavrentiev-type methods as well as modifications suggested by the solut...
متن کاملFractional regularization matrices for linear discrete ill-posed problems
The numerical solution of linear discrete ill-posed problems typically requires regularization. Two of the most popular regularization methods are due to Tikhonov and Lavrentiev. These methods require the choice of a regularization matrix. Common choices include the identity matrix and finite difference approximations of a derivative operator. It is the purpose of the present paper to explore t...
متن کاملAn Application of Newton Type Iterative Method for Lavrentiev Regularization for Ill-Posed Equations: Finite Dimensional Realization
In this paper, we consider, a finite dimensional realization of Newton type iterative method for Lavrentiev regularization of ill-posed equations. Precisely we consider the ill-posed equation F (x) = f when the available data is f with ‖f − f‖ ≤ δ and the operator F : D(F ) ⊆ X → X is a nonlinear monotone operator defined on a real Hilbert space X . The error estimate obtained under a general s...
متن کاملA modified Newton-Lavrentiev regularization for nonlinear ill-posed Hammerstein-type operator equations
Recently, a new iterative method, called Newton-Lavrentiev Regularization (NLR) method, was considered by George (2006) for regularizing a nonlinear ill-posed Hammerstein-type operator equation in Hilbert spaces. In this paper we introduce a modified form of the NLR method and derive order optimal error bounds by choosing the regularization parameter according to the adaptive scheme considered ...
متن کاملOn the Method of Lavrentiev Regularization and Majorizing Sequence for Solving Ill-Posed Problems with Monotone Operators
distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper we consider the Lavrentiev regularization method for obtaining stable approximate solution to nonlinear ill-posed operator equations F (x) = y where F : D(F) ⊆ X −→ X is a nonlinear monotone...
متن کامل